Term rewriting for sale
نویسندگان
چکیده
Term rewriting has a large potential for industrial applications, but these applications are always larger than one could ever dream of: huge sets of rewrite rules and gigantic terms to rewrite pose interesting challenges for implementors and theoreti-cians alike. We give a brief overview of the generation of term-rewriting-based tools as done in the Asf+Sdf Meta-Environment and then we sketch two major applications of term rewriting: transformation of legacy COBOL systems and compilation of Asf+Sdf to C. Based on these experiences we suggest the study of topics that could further advance the use of term rewriting in industrial applications: persistent term databases, generalized LR parsing versus parallel term rewriting, and coordination languages versus strategy languages. It will turn out that we have an \alien" view on research in term rewriting: properties like connuence and termination are of very limited use when selling term rewriting to industry.
منابع مشابه
Applying Non-Contractual Methods and Quantitative Terms to Increase the Durability of Long-Term Natural Gas Sale Agreements
The success of long-term gas sales contracts is largely related to the ability of the seller and the buyer to adapt the terms of the contract to their conditions, infrastructure, facilities and market. If the buyer's demand changes from season to season and seasonally fluctuates, problems and complexities arise for the seller and he may need to provide the excess capacity to produce, refine and...
متن کاملرابطه متغیرهای کلان اقتصادی با میزان فروش بیمه نامه های درمان مکمل: 1369 - 1382
Introduction: This research follows the relationship between macro economic variable (such as inflation rate, national income percapita & unemployment rate) on sale rate of complementary insurance policies between 1369:1 until 1382:4 .with use of quarterly adjustment data Methods: In this research , VAR model has been used and the co-integration with stationary variables have been accounted and...
متن کاملTerm Graph Rewriting
Term graph rewriting is concerned with the representation of functional expressions as graphs, and the evaluation of these expressions by rule-based graph transformation. Representing expressions as graphs allows to share common subexpressions, improving the eeciency of term rewriting in space and time. Besides eeciency, term graph rewriting diiers from term rewriting in properties like termina...
متن کاملInfinitary Term Graph Rewriting
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can be used to reason about lazy evaluation. In this paper, we combine term graph rewriting and infinitary term rewriting thereby addressing both components of ...
متن کاملModular Termination of r-Consistent and Left-Linear Term Rewriting Systems
A modular property of term rewriting systems is one that holds for the direct sum of two disjoint term rewriting systems iff it holds for every involved term rewriting system. A term rewriting system is r-consistent iff there is no term that can be rewritten to two different variables. We show that the subclass of left-linear and r-consistent term rewriting systems has the modular termination p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 15 شماره
صفحات -
تاریخ انتشار 1998